How Flexible Is Answer Set Programming? An Experiment in Formalizing Commonsense in ASP
نویسنده
چکیده
This paper describes an exercise in the formalization of commonsense with Answer Set Programming aimed at finding the answer to an interesting riddle, whose solution is not obvious to many people. Solving the riddle requires a considerable amount of commonsense knowledge and sophisticated knowledge representation and reasoning techniques, including planning and adversarial reasoning. Most importantly, the riddle is difficult enough to make it unclear, at first analysis, whether and how Answer Set Programming or other formalisms can be used to solve it.
منابع مشابه
Augmenting Weight Constraints with Complex Preferences
Preference-based reasoning is a form of commonsense reasoning that makes many problems easier to express and sometimes more likely to have a solution. In this paper, we present an approach to introducing preferences in the weight constraint construct, which is a very useful programming construct widely adopted in Answer Set Programming (ASP). We show, mainly by means of examples, the usefulness...
متن کاملAn Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode applications involving search, optimization, and reasoning (e.g., commonsense reasoning and planning). This paper presents experimental comparisons between the declarative encodings of various computationally hard problem...
متن کاملFormalizing Psychological Knowledge in Answer Set Programming
In the field of psychology, a considerable amount of knowledge is expressed using only natural language, which complicates accurate studies and comparisons. We believe that Answer Set Programming (ASP) can be used successfully for the formalization of psychological knowledge. To demonstrate the viability of ASP for this task, in this paper we develop an ASP-based formalization of the mechanics ...
متن کاملExtending Action Language C+ by Formalizing Composite Actions
This paper extends action language C+ by introducing composite actions as sequential execution of primitive actions. Such extension leads to a more intuitive and flexible way to represent action domains, better exploit a general-purpose formalization, and improve the reasoning efficiency for large domains. The semantics of composite actions is defined by a translation to nonmonotonic causal the...
متن کاملModeling negotiation using multi-focused answer sets
Answer Set Programming (ASP) is a form of declarative programming based on the stable model semantics [5]. The idea of ASP is to represent a computational problem by a set of (propositional) rules P such that particular minimal models of P , the stable models, correspond to the solutions of the original problem. ASP has proven successful as an elegant and convenient vehicle for commonsense reas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009